Dynamic Continuous Distributed Constraint Optimization Problems

The Distributed Constraint Optimization Problem (DCOP) formulation is a powerful tool to model multi-agent coordination problems that are distributed by nature. While DCOPs assume variables discrete and the environment does not change over time, agents often interact in more dynamic complex environment. To address these limiting assumptions, researchers have proposed Dynamic (D-DCOPs) how dynamically time Continuous (C-DCOPs) with continuous constraints functional form. However, models each assumption of isolation, it remains challenge both Therefore, this paper, we propose (DC-DCOPs), novel nature variables, which inherent many problems. In addition, introduce several greedy algorithms solve DC-DCOPs discuss their theoretical properties. Finally, empirically evaluate random networks sensor network application.